Modified PSO algorithm for solving planar graph coloring problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولEnhanced PSO for Graph Coloring Problem
---------------------------------------------------------------------***--------------------------------------------------------------------Abstract— In this paper we have proposed a new Particle Swarm Optimization algorithm named Enhanced PSO. The proposed strategy consists of the concept of the Smallest Position Value rule. In this case the solution having the smallest position value will be ...
متن کاملAn improved Cuckoo Search Algorithm for Solving Planar Graph Coloring Problem
In this paper, we proposed an improved cuckoo search optimization (ICS) algorithm for solving planar graph coloring problem. The improved cuckoo search optimization algorithm is consisting of the walking one strategy, swap and inversion strategy and greedy strategy. The proposed improved cuckoo search optimization algorithm can solve the planar graph coloring problem using four-colors more effi...
متن کاملSolving Graph Coloring Problem by Fuzzy Clustering-Based Genetic Algorithm
The graph coloring problem is one of famous combinatoria1 optimization problerns. Some researchers attempted to solve combinatoria1 optimization problem with evolutionary a1gorithm, which can find near optima1 solution based on the evolution mechanism of the nature. However, it sometimes requires too much cost to eva1uate fitness of a large number of individuals in the population when applying ...
متن کاملModified cuckoo optimization algorithm (MCOA) to solve graph coloring problem
In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature, such as particle swarm optimization (PSO), firefly algorithm (FA) and cuckoo optimization algorithm (COA). Recently introduced COA, has proven its excellent capabilities, such as faster convergence and better global minimum achievement. In this paper a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress in Natural Science
سال: 2008
ISSN: 1002-0071
DOI: 10.1016/j.pnsc.2007.11.009